8 results
George J. Tourlakis. Computabitity. Reston Publishing Company, Reston, Va., 1984, x + 566 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 53 / Issue 4 / December 1988
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1255-1257
- Print publication:
- December 1988
-
- Article
- Export citation
Dennis F. Cudia and Wilson E. Singletary. The Post correspondence problem. The journal of symbolic logic, vol. 33 (1968), pp. 418–430. - Dennis F. Cudia and Wilson E. Singletary. Degrees of unsolvability in formal grammars. Journal of the Association for Computing Machinery, vol. 15 (1968), pp. 680–692.
-
- Journal:
- The Journal of Symbolic Logic / Volume 39 / Issue 1 / March 1974
- Published online by Cambridge University Press:
- 12 March 2014, pp. 185-186
- Print publication:
- March 1974
-
- Article
- Export citation
S. I. Adjan. Defining relations and algorithmic problems for groups and semigroups. English translation of XXXVIII 357 by M. Greendlinger. Proceedings of the Steklov Institute of Mathematics, no. 85 (for 1966, pub. 1967), American Mathematical Society, Providence1967, iii + 152 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 38 / Issue 2 / June 1973
- Published online by Cambridge University Press:
- 12 March 2014, pp. 338-339
- Print publication:
- June 1973
-
- Article
- Export citation
A. V. Kuznécov and V. Á. Gérčiu. O supérintuicionistskih logikah i finitnoj approksimiruémosti. Doklady Akadémii Nauk SSSR, vol. 195 (1970), pp. 1029–1032. - A. V. Kuznecov and V. A. Gerčiu. Superintuitionistic logics and finite approximability. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 11 no. 6 (for 1970, pub. 1971), pp. 1614–1619.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 4 / December 1972
- Published online by Cambridge University Press:
- 12 March 2014, p. 757
- Print publication:
- December 1972
-
- Article
- Export citation
A. V. Kuznecov. Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi. English translation of XXXVII 772 by E. Mendelson. American Mathematical Society translations, ser. 2 vol. 59 (1966), pp. 56–72.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 4 / December 1972
- Published online by Cambridge University Press:
- 12 March 2014, pp. 756-757
- Print publication:
- December 1972
-
- Article
- Export citation
Hao Wang. Tag systems and lag systems. Mathematische Annalen, vol. 152 (1963), pp. 65–74. - John Cocke and Marvin Minsky. Universality of tag systems with D = 2. Journal of the Association for Computing Machinery, vol. 11 (1964), pp. 15–20. - Stephen A. Cook. The solvability of the derivability problem for one-normal systems. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 223–225.
-
- Journal:
- The Journal of Symbolic Logic / Volume 36 / Issue 2 / June 1971
- Published online by Cambridge University Press:
- 12 March 2014, p. 344
- Print publication:
- June 1971
-
- Article
- Export citation
Raymond M. Smullyan, On Post 's canonical systems. The journal of symbolic logic, vol. 27 no. 1 (for 1962, pub. 1963), pp. 55–57.
-
- Journal:
- The Journal of Symbolic Logic / Volume 33 / Issue 4 / January 1969
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
- Print publication:
- January 1969
-
- Article
- Export citation
Ronald Harrop. Some structure results for propositional calculi. The journal of symbolic logic, vol. 30 (1965), pp. 271–292.
-
- Journal:
- The Journal of Symbolic Logic / Volume 32 / Issue 4 / February 1968
- Published online by Cambridge University Press:
- 12 March 2014, pp. 537-538
- Print publication:
- February 1968
-
- Article
- Export citation